This book constitutes the refereed proceedings of the 8th International Workshop on the Finite-State-Methods and Natural Language Processing, FSMNLP 2009. The workshop was held at the University of Pretoria, South Africa on July 2009. In total 21 papers were submitted and of those papers 13 were accepted as regular papers and a further 6 as extended abstracts. The papers are devoted to computational morphology, natural language processing, finite-state methods, automata, and related formal language theory.

In these, his memoirs, we see Harry's adolescent revolt against his all-powerful father and his flight to Canada after knocking him down in a row. Then there is the account of his adventures in the Lincolnshire Regiment before the outbreak of the First World War, his time in the trenches with the rats and the corpses and only his belief in the Almighty and in his Destiny to keep him going. He tells how he lost a fortune during the Depression, and then made another that he was to fritter away in luxury cruises in the last years of his life. The Second World War gives him a new 'raison d'etre' - first in the Home Guard and then in the 'Little Ships.'

He paints a vivid picture of a forgotten way of life, a life of ease, of loss, of heartbreak, and of adventure; though, strangely enough, he never speaks of his personal feelings - it wasn't the done thing.

He was fiercely proud and patriotic and adored all royalty and aristocracy, delighting in any occasion that permitted him to approach them. But his greatest pride was that of being, first and foremost, 'a Lincolnshire man.'

This is the story of one of America's most divisive trials and executions. Ferdinando Sacco and Bartolomeo Vanzetti were two Italian-born anarchists tried and executed for robbery in 1927 despite widespread doubt about their guilt and whether they received a fair trial. This book tells the story and includes the official FBI files.

This collection of snappy, humorous, earthy stories all have a sting in the tail. They portray aspects of life in France unsuspected by most casual visitors. Food and sex are rarely talked of with such delicate earthiness. Medicine, herbal remedies, crime, social niceties, witchcraft and religion are the reflecting mirrors that illuminate Fanny, Louis, Francine and Justin: the larger-than-life characters who invite you to share their France with you.

TheSixthInternationalConferenceonImplementationandApplicationof- tomata(CIAA2001)-the?rstoneheldinthesouthernhemisphere-was heldattheUniversityofPretoriainPretoria,SouthAfrica,on23-25July2001. ThisvolumeofSpringer'sLectureNotesinComputerSciencecontainsall thepapers(includingtheinvitedtalkbyGregorv. Bochmann)thatwerep- sentedatCIAA2001,aswellasanexpandedversionofoneoftheposterpapers displayedduringtheconference. Theconferenceaddressedtheissuesinautomataapplicationandimplemen- tion. Thetopicsofthepaperspresentedinthisconferencerangedfromautomata applicationsinsoftwareengineering,naturallanguageandspeechrecognition, andimageprocessing,tonewrepresentationsandalgorithmsfore?cientimp- mentationofautomataandrelatedstructures. Automatatheoryisoneoftheoldestareasincomputerscience. Researchin automatatheoryhasbeenmotivatedbyitsapplicationssinceitsearlystagesof development. Inthe1960sand1970s,automataresearchwasmotivatedheavily byproblemsarisingfromcompilerconstruction,circuitdesign,stringmatching, etc. Inrecentyears,manynewapplicationsofautomatahavebeenfoundin variousareasofcomputerscienceaswellasinotherdisciplines. Examplesofthe newapplicationsincludestatechartsinobject-orientedmodeling,?nitetra- ducersinnaturallanguageprocessing,andnondeterministic? nite-statemodels incommunicationprotocols. Manyofthenewapplicationscannotsimplyutilize theexistingmodelsandalgorithmsinautomatatheorytosolvetheirproblems. Newmodels,ormodi?cationsoftheexistingmodels,areneededtosatisfytheir requirements. Also,thesizesofthetypicalproblemsinmanyofthenewapp- cationsareastronomicallylargerthanthoseusedinthetraditionalapplications. Newalgorithmsandnewrepresentationsofautomataarerequiredtoreducethe timeandspacerequirementsofthecomputation. TheCIAAconferenceseriesprovidesaforumforthenewproblemsand challenges. Intheseconferences,boththeoreticalandpracticalresultsrelatedto theapplicationandimplementationofautomatawerepresentedanddiscussed, andsoftwarepackagesandtoolkitsweredemonstrated. Theparticipantsofthe conferenceserieswerefrombothresearchinstitutionsandindustry. Wethankalloftheprogramcommitteemembersandrefereesfortheire?orts inrefereeingandselectingpapers. Thisvolumewaseditedwithmuchhelpfrom NanetteSaesandHannekeDriever,whiletheconferenceitselfwasrunsmoothly withthehelpofElmarieWillemse,NanetteSaes,andTheoKoopman. VI Foreword WealsowishtothanktheSouthAfricanNRF(forfundingairfares)andthe DepartmentofComputerScience,UniversityofPretoria,fortheir?nancialand logisticsupportoftheconference. WealsothanktheeditorsoftheLectureNotes inComputerScienceseriesandSpringer-Verlag,inparticularAnnaKramer,for theirhelpinpublishingthisvolume. October2002 BruceW. Watson DerickWood CIAA 2001 Program Committee BernardBoigelot Universit'edeLiege,Belgium Jean-MarcChamparnaud Universit'edeRouen,France MaximeCrochemore UniversityofMarne-la-Vall'ee,France OscarIbarra UniversityofCaliforniaatSantaBarbara,USA LauriKarttunen XeroxPaloAltoResearchCenter,USA NilsKlarlund AT&TLaboratories,USA DenisMaurel Universit'edeTours,France MehryarMohri AT&TLaboratories,USA Jean-EricPin Universit'eParis7,France KaiSalomaa Queen'sUniversity,Canada HelmutSeidl TrierUniversity,Germany BruceWatson(Chair) UniversityofPretoria,SouthAfrica EindhovenUniversity,TheNetherlands DerickWood(Co-chair) HongKongUniversityofScience andTechnology,China ShengYu UniversityofWesternOntario,Canada Table of Contents UsingFiniteStateTechnologyinNaturalLanguageProcessingofBasque...1 I"nakiAlegria,MaxuxAranzabe,NereaEzeiza,AitzolEzeiza, andRubenUrizar CascadeDecompositionsareBit-VectorAlgorithms...13 AnneBergeronandSylvieHamel SubmoduleConstructionandSupervisoryControl:AGeneralization...27 Gregorv. Bochmann CountingtheSolutionsofPresburgerEquations withoutEnumeratingThem...40 BernardBoigelotandLouisLatour Brzozowski'sDerivativesExtendedtoMultiplicities...52 Jean-MarcChamparnaudandG'erardDuchamp FiniteAutomataforCompactRepresentation ofLanguageModelsinNLP...65 JanDaciukandGertjanvanNoord PastPushdownTimedAutomata...74 ZheDang,Tev?kBultan,OscarH. Ibarra,andRichardA. Kemmerer SchedulingHardSporadicTasksbyMeans ofFiniteAutomataandGeneratingFunctions...87 Jean-PhilippeDubernardandDominiqueGeniet Bounded-GraphConstruction forNoncanonicalDiscriminating-ReverseParsers...101 JacquesFarr'eandJos'eFortesGalvez ' Finite-StateTransducerCascadetoExtractProperNamesinTexts...115 NathalieFriburgerandDenisMaurel IsthisFinite-StateTransducerSequentiable?...125 Tamas ' Ga'al CompilationMethodsofMinimalAcyclicFinite-StateAutomata forLargeDictionaries...135 JorgeGran "a,Fco. MarioBarcala,andMiguelA. Alonso BitParallelism-NFASimulation...149 JanHolub ImprovingRasterImageRun-LengthEncodingUsingDataOrder...161 MarkusHolzerandMartinKutrib X Table of Contents EnhancementsofPartitioningTechniques forImageCompressionUsingWeightedFiniteAutomata ...1 77 FrankKatritzke,WolfgangMerzenich,andMichaelThomas Extractionof -CyclesfromFinite-StateTransducers...190 Andr'eKempe OntheSizeofDeterministicFiniteAutomata...202 Bo?rivojMelicharandJanSkryja CrystalLatticeAutomata...214 JimMorey,KamranSedig,RobertE. Mercer,andWayneWilson MinimalAdaptivePattern-MatchingAutomata forE?cientTermRewriting...221 NadiaNedjahandLuizadeMacedoMourelle AdaptiveRule-DrivenDevices-GeneralFormulationandCaseStudy...234 Joao " Jos'eNeto TypographicalNearest-NeighborSearchinaFinite-StateLexicon andItsApplicationtoSpellingCorrection...251 AgataSavary OntheSoftwareDesignofCellularAutomataSimulators forEcologicalModeling...261 YuriVelinov RandomNumberGenerationwith?-NFAs...263 LynettevanZijl SupernondeterministicFiniteAutomata...274 LynettevanZijl Author Index...289 Using Finite State Technology in Natural Language Processing of Basque Iaeaki Alegria, Maxux Aranzabe, Nerea Ezeiza, Aitzol Ezeiza, and Ruben Urizar Ixa taldea, University of the Basque Country, Spain i. alegria@si. ehu. es Abstract.

Six multi-period archaeological sites investigated in advance of gravel extraction in the London Borough of Havering between 1963 and 1997 form the basis of a landscape history of the Rainham and Upminster area. Residual Mesolithic finds from the study area include an adze. The first significant activity locally was an Early Neolithic ring ditch, which remained in use for about a millennium. During the Bronze Age the area was transformed by extensive woodland clearance and the creation of rectilinear fields and scattered farmsteads. The Iron Age saw more intensive landscape utilisation and settlement. About the time of the Roman invasion two farmsteads were fortified. A waterhole from one of these farmsteads revealed a large pottery assemblage dating to c. AD 60-70, showing a low level of Romanisation and few imported wares. A number of farmsteads were continuously occupied throughout the Roman period until after c. AD 370. The presence of Early Saxon activity at some sites suggests either continuity of occupation or only a short period of abandonment. These scattered Saxon farmsteads were probably abandoned during the Late Saxon period, when the rural settlement pattern generally changed to nucleated villages. Significant medieval remains include a farmstead and a manorial enclosure.

Summability methods are transformations that map sequences (or functions) to sequences (or functions). A prime requirement for a "good" summability method is that it preserves convergence. Unless it is the identity transformation, it will do more: it will transform some divergent sequences to convergent sequences. An important type of theorem is called a Tauberian theorem. Here, we know that a sequence is summable. The sequence satisfies a further property that implies convergence. Borel's methods are fundamental to a whole class of sequences to function methods. The transformation gives a function that is usually analytic in a large part of the complex plane, leading to a method for analytic continuation. These methods, dated from the beginning of the 20th century, have recently found applications in some problems in theoretical physics.

On January 12, 1912, an army of textile workers stormed out of the mills in Lawrence, Massachusetts, commencing what has since become known as the "Bread and Roses" strike. Based on newspaper accounts, magazine reportage, and oral histories, Watson reconstructs a Dickensian drama involving thousands of parading strikers from fifty-one nations, unforgettable acts of cruelty, and even a protracted murder trial that tested the boundaries of free speech. A rousing look at a seminal and overlooked chapter of the past, Bread and Roses is indispensable reading.